Frequent Manipulability of Elections: The Case of Two Voters

نویسندگان

  • Shahar Dobzinski
  • Ariel D. Procaccia
چکیده

The recent result of Friedgut, Kalai and Nisan [9] gives a quantitative version of the Gibbard-Satterthwaite Theorem regarding manipulation in elections, but holds only for neutral social choice functions and three alternatives. We complement their theorem by proving a similar result regarding Pareto-Optimal social choice functions when the number of voters is two. We discuss the implications of our results with respect to the agenda of precluding manipulation in elections by means of computational hardness.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Analysis of the Influence of Radio Political Campaign Messages on Voters’ Electoral Behavior in Kano, Nigeria

This paper will examine the influence of radio political campaign messages on the electorates’ voting behavior in Kano – Nigeria, with a focus on the 2015 general elections. It seeks to ascertain the extent that the electorates in Kano – Nigeria were exposed to radio political campaign messages, as well as the extent to which such messages influenced their voting decisions. Equally, the study c...

متن کامل

Multiple Referenda and Multiwinner Elections Using Hamming Distances: Complexity and Manipulability

We study multiple referenda and committee elections, when the ballot of each voter is simply a set of approved binary issues (or candidates). Two well-known rules under this model are the commonly used candidate-wise majority, also called the minisum rule, as well as the minimax rule. In the former, the elected committee consists of the candidates approved by a majority of voters, whereas the l...

متن کامل

Asymptotic collusion-proofness of voting rules: the case of large number of candidates

We study manipulability in elections when the number of candidates is large. Elections with a large number of voters have been studied in the literature and the focus of this paper is on studying election with a large number of candidates. Manipulability, when the number of candidates is large, is significant in the context of computational social choice. Our investigation in this paper covers ...

متن کامل

Strategic manipulability of self-selective social choice rules

We provide exact relations giving the probability of individual and coalitional manipulation of three specific social choice functions (Borda rule, Copeland rule, Plurality rule) in three-alternative elections when the notion of self-selectivity is imposed. The results suggest that the Borda rule is more vulnerable to coalitional manipulation than the Copeland rule and the Plurality rule. Howev...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008